Continuous Partial Maps on Block Designs
نویسندگان
چکیده
منابع مشابه
On the size of partial block designs with large blocks
A t − (n, k, ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly of the edges (blocks). A partial t − (n, k, ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most edges; or equivalently the intersection of every set of + 1 blocks contains fewer than t elements. Let us denote by f (n, k, t) ...
متن کاملTesting block subdivision algorithms on block designs
Integrated land use-transportation models predict future transportation demand taking into account how households and firms arrange themselves partly as a function of the transportation system. Recent integrated models require parcels as inputs and produce household and employment predictions at the parcel scale. Block subdivision algorithms automatically generate parcel patterns within blocks....
متن کاملOn Pushouts of Partial Maps
The paper gives a sufficient condition for the existence of all pushouts in an arbitrary category of partial maps C∗M that is necessary whenever the category of total maps C ⊆ C∗M has cocones of spans; the latter is the case in all slice categories of C and thus the condition is necessary locally. The main theorem is that, given an admissible class of monos M in a category C that has cocones of...
متن کاملOn directed designs with block size five
In a t-(v, k, λ) directed design the blocks are ordered k-tuples and every ordered t-tuple of distinct points occurs in exactly λ blocks (as a subsequence). We study t-(v, 5, 1) directed designs with t = 3 and t = 4. In particular, we construct the first known examples, and an infinite class, of 3-(v, 5, 1) directed designs, and the first known infinite class of 4-(v, 5, 1) directed designs.
متن کاملOn the number of indecomposable block designs
A t-(v; k;) design D is a system (multiset) of k-element subsets (called blocks) of a v-element set V such that every t-element subset of V occurs exactly times in the blocks of D. A t-(v; k;) design D is called inde-composable (or elementary) if and only if there is no subsystem which is a t-(v; k; 0) design with 0 < 0 <. It is known that the number of inde-composable designs for given paramet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mohyla Mathematical Journal
سال: 2019
ISSN: 2663-0648,2617-7080
DOI: 10.18523/2617-70802201924-32